Ased on G Reen - C Hannel P Hoto R Esponse N on - U Niformity ( G - Prnu )
نویسنده
چکیده
This paper proposes a simple but yet an effective new method for the problem of digital video camera identification. It is known that after an exposure time of 0.15 seconds, the green channel is the noisiest of the three RGB colour channels [5]. Based on this observation, the digital camera pattern noise reference, which is extracted using only the green channel of the frames and is called Green-channel Photo Response Non-Uniformity (G-PRNU), is exploited as a fingerprint of the camera. The green channels are first resized to a standard frame size (512x512) using bilinear interpolation. Then the camera fingerprint is obtained by a wavelet based denoising filter described in [4] and averaged over the frames. 2-D correlation coefficient is used in the detection test. This method has been evaluated using 290 video sequences taken by four consumer digital video cameras and two mobile phones. The results show G-PRNU has potential to be a reliable technique in digital video camera identification, and gives better results than PRNU.
منابع مشابه
Co-centralizing generalized derivations acting on multilinear polynomials in prime rings
Let $R$ be a noncommutative prime ring of characteristic different from $2$, $U$ the Utumi quotient ring of $R$, $C$ $(=Z(U))$ the extended centroid of $R$. Let $0neq ain R$ and $f(x_1,ldots,x_n)$ a multilinear polynomial over $C$ which is noncentral valued on $R$. Suppose that $G$ and $H$ are two nonzero generalized derivations of $R$ such that $a(H(f(x))f(x)-f(x)G(f(x)))in ...
متن کاملAmitraz Poisoning; A case study
A m i t r a z, a n i ns e c t i c i d e /a ca ri c i de of the f o r m a m i d i n e p e st i c i d e s group, is a ? 2 a d r e n e r g i c ag on i st a nd of t he a m i d i ne c h e m i ca l f a m il y generally us e d to c o n t r ol animal e c top a r a s i t e s. Poisoning due to am i t r a z i s r a r e and character...
متن کاملStructural Lexical Heuristics in the Automatic Analysis of Portuguese
T he p ap er d iscusses, on th e lex ica l level, th e in teg ra tio n o f h eu ris tic so lu tions in to a lex ico n b ased and ru le g o v ern ed sy stem fo r th e au to m atic ana lysis o f u n res tric ted P ortuguese tex t. In particu la r, a m o rp h o lo g y b ased an a ly tic app ro ach to lex ica l h eu ris tics is p resen ted and evaluated . T he tag g er in v o lv ed u ses a 50 .000 ...
متن کاملRenormalized Solutions for Strongly Nonlinear Elliptic Problems with Lower Order Terms and Measure Data in Orlicz-Sobolev Spaces
The purpose of this paper is to prove the existence of a renormalized solution of perturbed elliptic problems$ -operatorname{div}Big(a(x,u,nabla u)+Phi(u) Big)+ g(x,u,nabla u) = mumbox{ in }Omega, $ in the framework of Orlicz-Sobolev spaces without any restriction on the $M$ N-function of the Orlicz spaces, where $-operatorname{div}Big(a(x,u,nabla u)Big)$ is a Leray-Lions operator defined f...
متن کاملFurther results on odd mean labeling of some subdivision graphs
Let G(V,E) be a graph with p vertices and q edges. A graph G is said to have an odd mean labeling if there exists a function f : V (G) → {0, 1, 2,...,2q - 1} satisfying f is 1 - 1 and the induced map f* : E(G) → {1, 3, 5,...,2q - 1} defined by f*(uv) = (f(u) + f(v))/2 if f(u) + f(v) is evenf*(uv) = (f(u) + f(v) + 1)/2 if f(u) + f(v) is odd is a bijection. A graph that admits an odd mean labelin...
متن کامل